Diameter and Stationary Distribution of Random $r$-Out Digraphs
نویسندگان
چکیده
منابع مشابه
Diameter and Stationary Distribution of Random $r$-out Digraphs
Let D(n, r) be a random r-out regular directed multigraph on the set of vertices {1, . . . , n}. In this work, we establish that for every r ≥ 2, there exists ηr > 0 such that diam(D(n, r)) = (1 + ηr + o(1)) logr n. Our techniques also allow us to bound some extremal quantities related to the stationary distribution of a simple random walk on D(n, r). In particular, we determine the asymptotic ...
متن کاملStationary distribution and cover time of random walks on random digraphs
We study properties of a simple random walk on the random digraph Dn,p when np = d log n, d > 1. We prove that whp the value πv of the stationary distribution at vertex v is asymptotic to deg(v)/m where deg(v) is the in-degree of v and m = n(n − 1)p is the expected number of edges of Dn,p. If d = d(n) → ∞ with n, the stationary distribution is asymptotically uniform whp. Using this result we pr...
متن کاملRandom Cayley digraphs of diameter 2 and given degree
We consider random Cayley digraphs of order n with uniformly distributed generating sets of size k. Specifically, we are interested in the asymptotics of the probability that such a Cayley digraph has diameter two as n → ∞ and k = f(n), focusing on the functions f(n) = bnc and f(n) = bcnc. In both instances we show that this probability converges to 1 as n→ ∞ for arbitrary fixed δ ∈ ( 1 2 , 1) ...
متن کاملThe diameter of random Cayley digraphs of given degree
We consider random Cayley digraphs of order n with uniformly distributed generating set of size k. Specifically, we are interested in the asymptotics of the probability such a Cayley digraph has diameter two as n →∞ and k = f(n). We find a sharp phase transition from 0 to 1 as the order of growth of f(n) increases past √ n log n. In particular, if f(n) is asymptotically linear in n, the probabi...
متن کاملThe diameter of lifted digraphs
The theory of voltage assignments enables one to construct large graphs (directed as well as undirected) as covering spaces of smaller base graphs. All properties of the large graph, called the lift, are determined by the structure of the base graph and by an assignment of voltages (elements of some group) to its arcs. In this paper we prove several upper bounds on the diameter of the lift in t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2020
ISSN: 1077-8926
DOI: 10.37236/9485